Perturbative search for dead-end CFTs
نویسندگان
چکیده
To explore the possibility of self-organized criticality, we look for CFTs without any relevant scalar deformations (a.k.a. dead-end CFTs) within power-counting renormalizable quantum field theories with a weakly coupled Lagrangian description. In three dimensions, the only candidates are pure (Abelian) gauge theories, which may be further deformed by Chern-Simons terms. In four dimensions, we show that there are infinitely many non-trivial candidates based on chiral gauge theories. Using the three-loop beta functions, we compute the gap of scaling dimensions above the marginal value, and it can be as small as O(10−5) and robust against the perturbative corrections. These classes of candidates are very weakly coupled and our perturbative conclusion seems difficult to refute. Thus, the hypothesis that non-trivial dead-end CFTs do not exist is likely to be false in four dimensions.
منابع مشابه
Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning
A key technique for proving unsolvability in classical planning are dead-end detectors ∆: effectively testable criteria sufficient for unsolvability, pruning (some) unsolvable states during search. Related to this, a recent proposal is the identification of traps prior to search, compact representations of non-goal state sets T that cannot be escaped. Here, we create new synergy across these id...
متن کاملA non - rational CFT with central charge 1
Two dimensional conformal field theories with central charge one are discussed. After a short review of theories based on one free boson, a different CFT is described, which is obtained as a limit of minimal models. We will be concerned with unitary two dimensional conformal field theories. Such theories describe, for example, critical points of equilibrium statistical mechanics systems in two ...
متن کاملState space search nogood learning: Online refinement of critical-path dead-end detectors in planning
Conflict-directed learning is ubiquitous in constraint satisfaction problems like SAT, but has been elusive for state space search on reachability problems like classical planning. Almost all existing approaches learn nogoods relative to a fixed solution-length bound, in which case planning/reachability reduces to a constraint satisfaction problem. Here we introduce an approach to learning more...
متن کاملDead-End Elimination for Weighted CSP
Soft neighborhood substitutability (SNS) is a powerful technique to automatically detect and prune dominated solutions in combinatorial optimization. Recently, it has been shown in [26] that enforcing partial SNS (PSNS) during search can be worthwhile in the context of Weighted Constraint Satisfaction Problems (WCSP). However, for some problems, especially with large domains, PSNS is still too ...
متن کاملCSP Search Algorithms with Responsibility Sets and Kernels
A CSP lookahead search algorithm, like FC or MAC, explores a search tree during its run. Every node of the search tree can be associated with a CSP created by the refined domains of unassigned variables. If the algorithm detects that the CSP associated with a node is insoluble, the node becomes a dead-end. A strategy of pruning ”by analogy” states that the current node of the search tree can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015